Evolutionary Dynamics on Small-order Graphs

We study the stochastic birth-death model for structured finite populations popularized by Lieberman et al. [Lieberman, E., Hauert, C., Nowak, M.A., 2005. Evolutionary dynamics on graphs. Nature 433, 312-316]. We consider all possible connected undirected graphs of orders three through eight. For each graph, using the Monte Carlo Markov Chain simulations, we determine the fixation probability of a mutant introduced at every possible vertex. We show that the fixation probability depends on the vertex and on the graph. A randomly placed mutant has the highest chances of fixation in a star graph, closely followed by star-like graphs. The fixation probability was lowest for regular and almost regular graphs. We also find that within a fixed graph, the fixation probability of a mutant has a negative correlation with the degree of the starting vertex.